In computer science, a queue data structure is your basic first-in, first-out ( FIFO) structure. 在计算机科学中,队列数据结构是基本的先进先出(FIFO)结构。
From a logical viewpoint, there is a FIFO priority-based queue of lock contenders similar to the execution queue of threads waiting to execute. 从逻辑观点来看,锁争用者的FIFO基于优先级的队列与等待执行的线程执行队列相似。
If all tokens of all endpoints in the group are assigned, the mediation flow request is stored in a FIFO queue until a token becomes free. 如果一个组中的所有端点的所有令牌都已分配出去,那么仲裁流请求将储存在一个FIFO队列中,直至有令牌转变成未占用状态。
The BlockingQueue interface states that it is a Queue, meaning that its items are stored in first in, first out ( FIFO) order. BlockingQueue接口表示它是一个Queue,意思是它的项以先入先出(FIFO)顺序存储。
Basically, a queue is a first-in, first-out ( FIFO) data structure. 基本上,一个队列就是一个先入先出(FIFO)的数据结构。
This script looks at the records in the queue table and reads them if the record is not paused and has not yet been announced in FIFO order, with all system messages taking priority regardless of age. 该脚本查看队列表格中的记录,如果记录没有暂停并且在FIFO顺序中没有播放,则阅读它们,所有系统消息优先(忽略时间)。
The instructions PUSH and QUEUE correspond to LIFO and FIFO operations on the stack. 指令PUSH和QUEUE对应的是对栈的LIFO和FIFO操作。
This means that first-in-first-out ( FIFO) processing is not guaranteed, as is common with many message queue implementations. 这意味着先进先出(first-in-first-out,FIFO)处理不得到保证,这在很多消息队列实现中都很常见。
Logically, you can view the system as managing a single FIFO queue, termed a run-queue, for each of the40 priorities. 逻辑上可将系统看作:为(40个中的)每个优先级管理一个FIFO序列,称为运行队列。
For those unfamiliar with the concept of a blocking queue, it is essentially a FIFO data structure, with a twist. 假如不熟悉阻塞队列概念,它实质上就是一种带有一点扭曲的FIFO数据结构。
The receiver side reads out the data from FIFO queue according to the type of data, and form one integrated frame to make sure of the integrality of frame. 接收方根据所传类型,将读出数据按自动行成帧处理以保证帧完整。
Host PC switches operation mode after that the new work mode was written into FIFO queue of command and the slave PC responded. 主机切换工作方式,需待新方式字写入CP队列且得到从机应答。
One is that the rest queue scheduling algorithm takes place of FIFO ( First In First Out) scheduling algorithm on the router, enhancing differential service for different sort data flows. 一类方法是在路由器处将先来先服务(FIFO)调度算法用其他队列调度算法代替,增加对不同类别数据的区分服务;
The function and principle of First-in-first-out ( FIFO) register queue device design are introduced. 介绍了寄存器堆队列装置(FIFO)的作用和设计原理。
To ensure the requirements of the hard real-time tasks, these tasks were organized in a run queue pointed by run_-queue [ 0], an element of a point array, and FIFO schedule strategy was used for them. 为严格保证硬实时任务的实时性,将其单独放在一个队列中,由指针数组的元素run-queue[0]指向,采用FIFO调度算法;
Firstly, FIFO queue is studied in queue management discipline and mathematical expression of buffer capacity is given, then tandem queueing model is studied and performance analysis is given; 在队列管理策略中,首先研究了FIFO排队策略,给出了缓存器容量设计的计算公式,并在此基础上对串联排队模型进行性能分析;
A Simulation Model for A Stochastic Inventory System of FIFO Storage Queue Management FIFO存贮队列管理的随机库存系统的仿真模型
Simulation shows that, compared with PCMA in which FIFO queue is adopted, a good improvement will be obtained when in use of PCMA+. 大量仿真结果表明,PCMA+协议相对于采用FIFO队列的PCMA协议在性能上有较大的提高。
This paper proposes a priory FIFO queue architecture PFQ after studying conventional buffering and queueing techniques. 该文在研究已有的缓冲排队方案基础上,提出一种支持优先级FIFO排队的硬件体系结构PFQ(PriorityFIFOQueue)。
Design and Application of Multi-Queue FIFO in Core Routers 多队列FIFO的设计及其在核心路由器中的应用
FIFO queue is used in CNC system to exchange data among multiple CPUs, the complex NC feeding control is accomplished with serial/ parallel transmission mode. FIFO队列用于数控系统多CPU间的数据交换,采用串并行传输方式完成复杂的加工控制。
It is based on the basic idea of shift register. Each priority FIFO queue is organized as a linked list. It solves the HOL ( Head of Line) problem efficiently by setting the high-speed local bus. PFQ借鉴了移位寄存器的基本思想,按链表形式组织每个FIFO队列,通过设置高速局部总线,有效解决了头信元阻塞问题。
In addition, the FIFO data queue is used as the transmitting buffer, and the semaphores are used as the communication path between the receiving task and the ISR. 同时,采用了FIFO数据队列作为发送数据缓冲,并在接收数据时,采用了信号量方式完成中断服务子程序与接收接口任务间的通信。
Based on limit, theorems of the standard queuing networks this paper defined a class of batch processing queuing networks, and derive the diffusion limit for queue length of each service station under FIFO service disciplines when the traffic intensity more than one. 在标准排队网络扩散近似分析的基础上,定义了一类批处理排队网络,在批FIFO服务原则下,给出了重负荷情形下各服务台队长的扩散近似存在的充分条件。